package leetcode.D100.T64;

import util.GraphUtil;

/**
 * @File Info: leetcode -- <M64>
 * @Author: DYZ
 * @Create: 2021-08-12 23:26:06 星期四
 */

public class M64 {
    public static void main(String[] args) {
        int[][] grid = GraphUtil.parseGraph("[[1,3,1],[1,5,1],[4,2,1]]");
        System.out.println(new Solution().minPathSum(grid));
    }
}
